Approximate multipartite version of the Hajnal–Szemerédi theorem
نویسندگان
چکیده
منابع مشابه
Approximate multipartite version of the Hajnal-Szemerédi theorem
Let q be a positive integer, and G be a q-partite simple graph on qn vertices, with n vertices in each vertex class. Let δ = k k+1 + λ, where k = q + 4dlog qe and λ is a positive real number. If each vertex of G is adjacent to at least δn vertices in each of the other vertex classes, q is bounded and n is large enough, then G has a Kq-factor.
متن کاملAn Approximate, Multivariable Version of Specht’s Theorem
In this paper we provide generalizations of Specht’s Theorem which states that two n× n matrices A and B are unitarily equivalent if and only if all traces of words in two non-commuting variables applied to the pairs (A, A∗) and (B, B∗) coincide. First, we obtain conditions which allow us to extend this to simultaneous similarity or unitary equivalence of families of operators, and secondly, we...
متن کاملA More General Version of the Costa Theorem
In accordance with the Costa theorem, the interference which is independent of the channel input and known non-causally at the transmitter, does not affect the capacity of the Gaussian channel. In some applications, the known interference depends on the input and hence has some information. In this paper, we study the channel with input dependent interference and prove a capacity theorem that n...
متن کاملA multipartite Hajnal-Szemerédi theorem
The celebrated Hajnal-Szemerédi theorem gives the precise minimum degree threshold that forces a graph to contain a perfect Kk-packing. Fischer’s conjecture states that the analogous result holds for all multipartite graphs except for those formed by a single construction. Recently, we deduced an approximate version of this conjecture from new results on perfect matchings in hypergraphs. In thi...
متن کاملApproximate and Multipartite Quantum Correlation (Communication) Complexity
The concepts of quantum correlation and communication complexity have been proposed to quantify the worst-case computational resources needed in generating bipartite classical distributions or bipartite quantum states in the single-shot setting by Zhang (Proc. 3rd Innov Theor Comput., pp. 39-59, 2012). The former characterizes the minimal size of the initial shared state needed if no communicat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2012
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2011.10.003